On Even and Odd Latin Squares

نویسنده

  • Jeannette C. M. Janssen
چکیده

Latin squares can be classified as odd or even according to the signs of the permutations given by their rows and columns. In this paper, the behaviour of the parities of a latin square under the action of the isotopy group (permuting rows, columns, and symbols) and the transformation group (interchanging rows, columns, and symbols) is analyzed. A rule is given that shows that the behaviour of parities under the action of the transformation group is completely determined, and only depends on the order n. Also, we give a short proof of the equivalence of the conjectures of Alon-Tarsi and Huang-White and present the results of a computer calculation that show that the number of even and odd latin squares of order 8 are not equal, thus proving the Alon-Tarsi conjecture for this particular order.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cycle Switches in Latin Squares

Cycle switches are the simplest changes which can be used to alter latin squares, and as such have found many applications in the generation of latin squares. They also provide the simplest examples of latin interchanges or trades in latin square designs. In this paper we construct graphs in which the vertices are classes of latin squares. Edges arise from switching cycles to move from one clas...

متن کامل

Latin Squares with No Transversals

A k-plex in a latin square of order n is a selection of kn entries that includes k representatives from each row and column and k occurrences of each symbol. A 1-plex is also known as a transversal. It is well known that if n is even then Bn, the addition table for the integers modulo n, possesses no transversals. We show that there are a great many latin squares that are similar to Bn and have...

متن کامل

Proof of the Alon-Tarsi Conjecture for n=2rp

The Alon-Tarsi conjecture states that for even n, the number of even latin squares of order n diiers from the number of odd latin squares of order n. Zappa 6] found a generalization of this conjecture which makes sense for odd orders. In this note we prove this extended Alon-Tarsi conjecture for prime orders p. By results of Drisko 2] and Zappa 6], this implies that both conjectures are true fo...

متن کامل

Proof of the Alon - Tarsi Conjecture for n = 2 rp Arthur

The Alon-Tarsi conjecture states that for even n, the number of even latin squares of order n differs from the number of odd latin squares of order n. Zappa [6] found a generalization of this conjecture which makes sense for odd orders. In this note we prove this extended Alon-Tarsi conjecture for prime orders p. By results of Drisko [2] and Zappa [6], this implies that both conjectures are tru...

متن کامل

Some Constructions of Non-Commutative Latin Squares of Order n

Let n be an integer. We show the existence of at least three non-isomorphic non-commutative Latin squares of order n which are embeddable in groups when n ≥ 5 is odd. By using a similar construction for the case when n ≥ 4 is even, we show that certain non-commutative Latin squares of order n are not embeddable in groups. Keywords—group, Latin square, embedding.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. A

دوره 69  شماره 

صفحات  -

تاریخ انتشار 1995